Log ind
Computer Science for IGCSE & O level - Boolean Logic (Section 4 - No. 47)
What is the simplified form of A.A in Boolean algebra?
A
0
1
A'
Forklaring
In Boolean algebra, A.A = A
Kommentarer (0)
Log ind for at kommentere
Reklame
Tillad, at javascript indlæser denne side korrekt
